Computing lower and upper expected first-passage and return times in imprecise birth–death chains
نویسندگان
چکیده
منابع مشابه
Calculating bounds on expected return and first passage times in finite-state imprecise birth-death chains
We provide simple methods for computing exact bounds on expected return and first passage times in finite-state birth-death chains, when the transition probabilities are imprecise, in the sense that they are only known to belong to convex closed sets of probability mass functions. We describe a precise birth-death chain and then we define an imprecise version of it. We present the main results ...
متن کاملEfficiency distribution and expected efficiencies in DEA with imprecise data
Several methods have been proposed for ranking the decision-making units (DMUs) in data envelopment analysis (DEA) with imprecise data. Some methods have only used the upper bound efficiencies to rank DMUs. However, some other methods have considered both of the lower and upper bound efficiencies to rank DMUs. The current paper shows that these methods did not consider the DEA axioms and may be...
متن کاملA morphologic and anatomic evaluation of furcation area in the upper and lower first molars
A morphologic and anatomic evaluation of furcation area in the upper and lower first molars Dr. V. Esfahanian* - Dr. M. Ketabi* - Dr. M. Hafezibakhtiari** - Dr. SH. Ashtari** *- Assistant Professor of Periodontics Dept. - Faculty of Dentistry – Isfahan Islamic Azad University (Khorasgan). **- Dentist. Background and Aim: Microbial plaque has been recognized as the main cause of periodontal dise...
متن کاملFirst Passage Times, Lifetimes, and Relaxation Times of Unfolded Proteins.
The dynamics of proteins in the unfolded state can be quantified in computer simulations by calculating a spectrum of relaxation times which describes the time scales over which the population fluctuations decay to equilibrium. If the unfolded state space is discretized, we can evaluate the relaxation time of each state. We derive a simple relation that shows the mean first passage time to any ...
متن کاملStationary Distributions and Mean First Passage Times of Perturbed Markov Chains
Stationary distributions of perturbed finite irreducible discrete time Markov chains are intimately connected with the behaviour of associated mean first passage times. This interconnection is explored through the use of generalized matrix inverses. Some interesting qualitative results regarding the nature of the relative and absolute changes to the stationary probabilities are obtained togethe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2017
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2016.08.008